Improving TSP Tours Using Dynamic Programming over Tree Decompositions
نویسندگان
چکیده
Given a traveling salesman problem (TSP) tour H in graph G a k-move is an operation which removes k edges from H , and adds k edges of G so that a new tour H ′ is formed. The popular k-OPT heuristic for TSP finds a local optimum by starting from an arbitrary tour H and then improving it by a sequence of k-moves. Until 2016, the only known algorithm to find an improving k-move for a given tour was the naive solution in time O(n). At ICALP’16 de Berg, Buchin, Jansen and Woeginger showed an O(n)-time algorithm. We show an algorithm which runs in O(nk) time, where limk→∞ ǫk = 0. It improves over the state of the art for every k ≥ 5. For the most practically relevant case k = 5 we provide a slightly refined algorithm running in O(n) time. We also show that for the k = 4 case, improving over the O(n)-time algorithm of de Berg et al. would be a major breakthrough: an O(n)-time algorithm for any ǫ > 0 would imply an O(n)-time algorithm for the All Pairs Shortest Paths problem, for some δ > 0.
منابع مشابه
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
Dynamic Programming (DP) over tree decompositions is a well-established method to solve problems – that are in general NP-hard – efficiently for instances of small treewidth. Experience shows that (i) heuristically computing a tree decomposition has negligible runtime compared to the DP step; (ii) DP algorithms exhibit a high variance in runtime when using different tree decompositions; in fact...
متن کاملCut and Count and Representative Sets on Branch Decompositions
Recently, new techniques have been introduced to speed up dynamic programming algorithms on tree decompositions for connectivity problems: the ‘Cut and Count’ method and a method called the rank-based approach, based on representative sets and Gaussian elimination. These methods respectively give randomised and deterministic algorithms that are single exponential in the treewidth, and polynomia...
متن کاملProceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009
We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good ...
متن کاملApplication of Genetic Recombination to Genetic Local Search in TSP
In this paper, an approach based upon Genetic Recombination is proposed, and applied to the Traveling Salesman Problem (TSP). The algorithm is composed of two Sample Genetic Algorithms (SGAs) which only consist of the basic genetic operators such as selection, crossover and mutation. One of the SGAs is named as the Global Genetic Algorithm (GGA), and encompasses the main tours where it is desig...
متن کاملThe D-FLAT System for Dynamic Programming on Tree Decompositions
Complex reasoning problems over large amounts of data pose a great challenge for computer science. To overcome the obstacle of high computational complexity, exploiting structure by means of tree decompositions has proved to be effective in many cases. However, the implementation of suitable efficient algorithms is often tedious. D-FLAT is a software system that combines the logic programming l...
متن کامل